Normal forms for connectedness in categories
نویسندگان
چکیده
منابع مشابه
Normal forms for connectedness in categories
The paper gives a simple result on the existence of normal forms for the following equivalence relation between objects of a category: A B if and only if there are maps A ?! B and B ?! A, under the hypothesis that the category has epi-mono factorizations and each object has nitely many sub-objects and quotient-objects. Applications to algebra, logic, automata theory, databases are presented. Ge...
متن کاملOrbital Normal Forms for a family of-zero Singularity
Consider a Dynamical system x'=F(x,µ) such that its linear part has a pair of imaginary eigenvalues and one zero eigenvalue (Hopf zero singularity). Recently, the simplest normal form for this singular system has been obtained by sl(2) Lie algebra theory and the decomposition of space into three invariant subspaces. The normal form of this singular system is divided into three general cases. In...
متن کاملCascade Normal Forms for
In this paper, we introduce cascade normal forms for underactuated mechanical systems that are convenient for control design. These normal forms are partially linear which results from a well-known fact that un-deractuated systems can be partially linearized using a change of control 12]. The diiculty arises when the new control appears both in the linear and nonlin-ear subsystems. We introduce...
متن کاملNormal forms for binary relations
We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizing and induces a notion of computable normal form for terms. This notion of reduction thus leads ...
متن کاملNormal Forms for Knowledge Compilation
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operates in PSPACE.Ordered factored negation normal form provides a canonical representation for any boolean function. Reduction strategies are developed that provide a unique reduced factored negation normal form. These com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2001
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(00)00048-8